Perfect state transfer on weighted graphs of the Johnson scheme
نویسندگان
چکیده
منابع مشابه
Perfect quantum state transfer with spinor bosons on weighted graphs.
A duality between the properties of many spinor bosons on a regular lattice and those of a single particle on a weighted graph reveals that a quantum particle can traverse an infinite hierarchy of networks with perfect probability in polynomial time, even as the number of nodes increases exponentially. The one-dimensional "quantum wire" and the hypercube are special cases in this construction, ...
متن کاملPerfect state transfer on quotient graphs
We prove new results on perfect state transfer of quantum walks on quotient graphs. Since a graph G has perfect state transfer if and only if its quotient G/π, under any equitable partition π, has perfect state transfer, we exhibit graphs with perfect state transfer between two vertices but which lack automorphism swapping them. This answers a question of Godsil (Discrete Mathematics 312(1):129...
متن کاملPerfect state transfer on signed graphs
We study perfect state transfer of quantum walks on signed graphs. Our aim is to show that negative edges are useful for perfect state transfer. First, we show that the signed join of a negative 2-clique with any positive (n, 3)-regular graph has perfect state transfer even if the unsigned join does not. Curiously, the perfect state transfer time improves as n increases. Next, we prove that a s...
متن کاملperfect state transfer in unitary cayley graphs over local rings
in this work, using eigenvalues and eigenvectors of unitary cayley graphs over finite local rings and elementary linear algebra, we characterize which local rings allowing pst occurring in its unitary cayley graph. moreover, we have some developments when $r$ is a product of local rings.
متن کاملOn the Nonexistence of Perfect Codes in the Johnson Scheme
Although it was conjectured by Delsarte in 1973 that no nontrivial perfect codes exist in the Johnson scheme, only very partial results are known. In this paper we considerably reduce the range in which perfect codes in the Johnson scheme can exist; e.g., we show that there are no nontrivial perfect codes in the Johnson graph J(2w qp, w), p prime. We give theorems about the structure of perfect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Letters in Mathematical Physics
سال: 2020
ISSN: 0377-9017,1573-0530
DOI: 10.1007/s11005-020-01298-6